Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of annihilator immunity. This construction provides functions with the maximum possible annihilator immunity and the weight, nonlinearity and algebraic degree of the functions can be properly calculated under certain cas...

متن کامل

Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity

In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible AI and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI . To get very good nonlinearity, which is important for practical cryptographic design, we g...

متن کامل

On the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count

This paper gives a construction method which can get a large class of Boolean functions with maximum algebraic immunity(AI) from one such giving function. Our constructions get more functions than any previous construction. The cryptographic properties, such as balance, algebraic degree etc, of those functions are studied. It shows that we can construct Boolean functions with better cryptograph...

متن کامل

Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity

Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...

متن کامل

Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity

In this paper, we study the construction of (2t+ 1)-variable Boolean functions with maximum algebraic immunity, and we also analyze some other cryptographic properties of this kind of functions, such as nonlinearity, resilience. We first identify several classes of this kind of functions. Further, some necessary conditions of this kind of functions which also have higher nonlinearity are obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2006

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-005-6300-x